On-line generalized Steiner problem
نویسندگان
چکیده
منابع مشابه
GRASP Algorithms for the Edge-survivable Generalized Steiner Problem
The design of a communication network where the connectivity between nodes must be kept even after failure of some links can be modeled as a Generalized Steiner Problem. It consists of computing the minimal cost subnetwork of a given feasible network where certain pairs of nodes must satisfy a number of disjoint connectivity requirements and is known to be an NP-Complete problem. This paper int...
متن کاملSolving Minimum Steiner Tree Problem Using Generalized Distributed Learning Automata
Minimum Steiner tree problem in a weighted graph is to find a least cost sub tree in the graph such that it contains special vertices called terminal points. Since this problem belongs to NP-Complete problems, many approximate algorithms including genetic algorithms and ant colony strategies have been designed for solving it. In this paper, we propose an algorithm based on distributed learning ...
متن کاملFactor 2 Approximation Algorithm for the Generalized Steiner Network Problem
We present a factor 2 approximation algorithm for nding a minimum-cost subgraph having at least a speciied number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, which is also known as the survivable network design problem. Our algorithm rst solves the linear relaxation of this problem, and then iteratively rounds oo the solution. Th...
متن کاملEvaluating simple metaheuristics for the Generalized Steiner Problem
This article presents the empirical evaluation of several simple metaheuristics applied to solve the Generalized Steiner Problem (GSP). This problem models the design of high-reliability communication networks, demanding a variable number of independent paths linking each pair of terminal nodes. GSP solutions are built using intermediate nodes for guaranteeing path redundancy, while trying to m...
متن کاملOn the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edge-costs, and some subsets of vertices called groups, with each group being equipped with a non-negative integer value (called its requirement); the problem is to find a minimum-cost tree which spans at least the requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.05.021